Problem specific heuristics for group scheduling problems in cellular manufacturing

The group scheduling problem commonly arises in cellular manufacturing systems, where parts are grouped into part families. It is characterized by a sequencing task on two levels: on the one hand, a sequence of jobs within each part family has to be identified while, on the other hand, a family sequence has to be determined. In order to solve this NP-hard problem usually heuristic solution approaches are used. In this thesis different aspects of group scheduling are discussed and problem specific heuristics are developed to solve group scheduling problems efficiently. Thereby, particularly characteristic properties of flowshop group scheduling problems, such as the structure of a group schedule or missing operations, are identified and exploited. In a simulation study for job shop manufacturing cells several novel dispatching rules are analyzed. Furthermore, a comprehensive review of the existing group scheduling literature is presented, identifying fruitful directions for future research

Prognostic Model Development with Missing Labels - A Condition-Based Maintenance Approach Using Machine Learning

Condition-based maintenance (CBM) has emerged as a proactive strategy for determining the best time for maintenance activities. In this paper, a case of a milling process with imperfect maintenance at a German automotive manufacturer is considered. Its major challenge is that only data with missing labels are available, which does not provide a sufficient basis for classical prognostic maintenance models. To overcome this shortcoming, a data science study is carried out that combines several analytical methods, especially from the field of machine learning (ML). These include time-domain and time–frequency domain techniques for feature extraction, agglomerative hierarchical clustering and time series clustering for unsupervised pattern detection, as well as a recurrent neural network for prognostic model training. With the approach developed, it is possible to replace decisions that were made based on subjective criteria with data-driven decisions to increase the tool life of the milling machines. The solution can be employed beyond the presented case to similar maintenance scenarios as the basis for decision support and prognostic model development. Moreover, it helps to further close the gap between ML research and the practical implementation of CBM

Solving Practical Railway Crew Scheduling Problems with Attendance Rates

Arising from a practical problem in German rail passenger transport, a prototype for a multi-period railway crew scheduling problem with attendance rates for conductors is developed and evaluated in this paper. The consideration of attendance rates is of increasing importance in regional transport networks and requires decision support. For this purpose business analytics is applied in order to offer an approach to transform real-world data to concrete operational decision support (action). The focus here is on the analysis step using a new set covering model with several essential restrictions integrated for the first time. A hybrid column generation approach is applied, which solves the pricing problem by means of a genetic algorithm. The artifact is evaluated with the help of a case study of three real-world transport networks. It is shown that the hybrid solution approach is able to solve the problem more effectively and efficiently compared to conventional approaches used in practice

Legislative Documents

Also, variously referred to as: House bills; House documents; House legislative documents; legislative documents; General Court documents

Problem specific heuristics for group scheduling problems in cellular manufacturing

The group scheduling problem commonly arises in cellular manufacturing systems, where parts are grouped into part families. It is characterized by a sequencing task on two levels: on the one hand, a sequence of jobs within each part family has to be identified while, on the other hand, a family sequence has to be determined. In order to solve this NP-hard problem usually heuristic solution approaches are used. In this thesis different aspects of group scheduling are discussed and problem specific heuristics are developed to solve group scheduling problems efficiently. Thereby, particularly characteristic properties of flowshop group scheduling problems, such as the structure of a group schedule or missing operations, are identified and exploited. In a simulation study for job shop manufacturing cells several novel dispatching rules are analyzed. Furthermore, a comprehensive review of the existing group scheduling literature is presented, identifying fruitful directions for future research